|
James Ian Munro (born July 10, 1947)〔Curriculum vitae, as printed in the front matter of ''Space-Efficient Data Structures, Streams, and Algorithms''.〕 is a Canadian computer scientist. He is known for his fundamental contributions to algorithms and data structures (including optimal binary search trees, priority queues, hashing, and space-efficient data structures). After earning a bachelor's degree in 1968 from the University of New Brunswick and a master's in 1969 from the University of British Columbia,〔 Munro finished his doctorate in 1971 from the University of Toronto, under the supervision of Allan Borodin. He is currently a University Professor in the David R. Cheriton School of Computer Science at the University of Waterloo. ==Awards and honors== Munro was elected as a member of the Royal Society of Canada in 2003. He became an ACM Fellow in 2008 for his contributions to algorithms and data structures. In 2013 a conference was held at Waterloo in his honor,〔(Conference on Space Efficient Data Structures, Streams and Algorithms ), August 15–16, 2013, retrieved 2013-11-04.〕 and a festschrift was published as its proceedings. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Ian Munro (computer scientist)」の詳細全文を読む スポンサード リンク
|